An Algebraic Characterization of Rainbow Connectivity
نویسندگان
چکیده
The use of algebraic techniques to solve combinatorial problems is studied in this paper. We formulate the rainbow connectivity problem as a system of polynomial equations. We first consider the case of two colors for which the problem is known to be hard and we then extend the approach to the general case. We also give a formulation of the rainbow connectivity problem as an ideal membership problem.
منابع مشابه
Further Hardness Results on Rainbow and Strong Rainbow Connectivity
A path in an edge-colored graph is rainbow if no two edges of it are colored the same. The graph is said to be rainbow connected if there is a rainbow path between every pair of vertices. If there is a rainbow shortest path between every pair of vertices, the graph is strong rainbow connected. We consider the complexity of the problem of deciding if a given edge-colored graph is rainbow or stro...
متن کاملRainbow Connectivity of Sparse Random Graphs
An edge colored graph G is rainbow edge connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted by rc(G), is the smallest number of colors that are needed in order to make G rainbow connected. In this work we study the rainbow connectivity of binomial random graphs at the connectivity threshold p = logn+ω n...
متن کاملRAINBOW CONNECTIVITY OF G(n, p) AT THE CONNECTIVITY THRESHOLD
An edge colored graph G is rainbow edge connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted by rc(G), is the smallest number of colors that are needed in order to make G rainbow connected. In this work we study the rainbow connectivity of the binomial graph G = G(n, p) at the connectivity threshold p = ...
متن کاملCulture and molecular characterization of phages isolated from rainbow trout farms and sewage treatment plants and investigation of their effects on Yersinia ruckeri
In the present study bacteriophages isolated from rainbow trout farms and sewage treatment plants were genetically identified and their effectiveness on Yersinia ruckeri isolates from clinical cases of red mouth disease was investigated. Fish samples suspected to red mouth disease were collected from rainbow trout farms located in west Azerbaijan. Y. ruckeri, the causative agent of red mouth d...
متن کاملHardness and Algorithms for Rainbow Connectivity
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted rc(G), is the smallest number of colors that are needed in order to make G rainbow connected. In addition to being a natural combinatorial problem, the rainbow connectivity problem is motivated by applications in cell...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012